Optimization Design Under Time-dependent Uncertainty
نویسندگان
چکیده
منابع مشابه
Optimization under Decision-Dependent Uncertainty
The efficacy of robust optimization spans a variety of settings with uncertainties bounded in predetermined sets. In many applications, uncertainties are affected by decisions and cannot be modeled with current frameworks. This paper takes a step towards generalizing robust optimization to problems with decisiondependent uncertainties. In general settings, we show these problems to be NP-comple...
متن کاملRobustness-based Design Optimization under Data Uncertainty
This paper proposes formulations and algorithms for design optimization under both aleatory (i.e., natural or physical variability) and epistemic uncertainty (i.e., imprecise probabilistic information), from the perspective of system robustness. The proposed formulations deal with epistemic uncertainty arising from both sparse and interval data without any assumption about the probability distr...
متن کاملRouting Optimization with Time Windows under Uncertainty
Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print ...
متن کاملTime-Dependent Utility and Action Under Uncertainty
We discuss representing and reasoning with knowledge about the time-dependent util ity of an agent's actions. Time-dependent utility plays a crucial role in the interac tion between computation and action under bounded resources. We present a semantics for time-dependent utility and describe the use of time-dependent information in deci sion contexts. We illustrate our discussion with exampl...
متن کاملPath Planning under Time-Dependent Uncertainty
Standard algorithms for finding the short est path in a graph require that the cost of a path be additive in edge costs, and typically assume that costs are determinis tic. We consider the problem of uncertain edge costs, with potential probabilistic de pendencies among the costs. Although these dependencies violate the standard dynamic programming decomposition, we identify a weaker stocha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Engineering and Technology Research
سال: 2016
ISSN: 2475-885X
DOI: 10.12783/dtetr/icmite20162016/4629